Contract Scheduling With Predictions
نویسندگان
چکیده
Contract scheduling is a general technique that allows to design system with interruptible capabilities, given an algorithm not necessarily interruptible. Previous work on this topic has largely assumed the interruption worst-case deadline unknown scheduler. In work, we study setting in which there potentially erroneous prediction concerning interruption. Specifically, consider describes time occurs, as well obtained response single or multiple binary queries. For both settings, investigate tradeoffs between robustness (i.e., performance assuming adversarial prediction) and consistency (i.e, error-free), from side of positive negative results.
منابع مشابه
Optimal Scheduling of Contract Algorithms with Soft Deadlines
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupted throughout their execution, at which point they must report their current solution. Simulating interruptible algorithms by means of schedules of executions of contract algorithms in parallel processors is a wellstud...
متن کاملContract-Based Distributed Scheduling for Distributed Processing
To an increasing extent, large-scale information processing is a distributed phenomenon. As the trend in computing moves further towards distributed networks of powerful workstations and information servers, we see the growing importance of solutions to dynamic distributed scheduling problems. In these domains, resource providers are distributed both geographicany and bureaucratically, so that ...
متن کاملRetractable Contract Network for Distributed Scheduling
This paper is about distributed scheduling where individual agents have potentially conflicting interests. It is motivated by BT’s workforce scheduling problem, where multiple service providers have to serve multiple service buyers. The service providers and buyers all attempt to maximize their own utility. The overall problem is a multi-objective optimization problem; for example, one has to m...
متن کاملOptimal Scheduling of Contract Algorithms for Anytime Problem-Solving
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then complete its execution within the allotted time. An interruptible algorithm, in contrast, can be interrupted at an arbitrary point in time, at which point it must report its currently best solution. It is known that contract algorithms can simulate...
متن کاملOptimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the alloted time. An interruptible algorithm, in contrast, can be interrupted at an arbitrary point in time and must produce a solution. It is known that contract algorithms can simulate interruptible algorithms using iter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i13.17394